On the Lattice Isomorphism Problem
نویسندگان
چکیده
We study the Lattice Isomorphism Problem (LIP), in which given two lattices L1 and L2 the goal is to decide whether there exists an orthogonal linear transformation mapping L1 to L2. Our main result is an algorithm for this problem running in time nO(n) times a polynomial in the input size, where n is the rank of the input lattices. A crucial component is a new generalized isolation lemma, which can isolate n linearly independent vectors in a given subset of Zn and might be useful elsewhere. We also prove that LIP lies in the complexity class SZK.
منابع مشابه
GENERAL FUZZY AUTOMATA BASED ON COMPLETE RESIDUATED LATTICE-VALUED
The present paper has been an attempt to investigate the general fuzzy automata on the basis of complete residuated lattice-valued ($L$-GFAs). The study has been chiefly inspired from the work by Mockor cite{15, 16, 17}. Regarding this, the categorical issue of $L$-GFAs has been studied in more details. The main issues addressed in this research include: (1) investigating the relationship betwe...
متن کاملOn the Lattice Distortion Problem
We introduce and study the Lattice Distortion Problem (LDP). LDP asks how “similar” two lattices are. I.e., what is the minimal distortion of a linear bijection between the two lattices? LDP generalizes the Lattice Isomorphism Problem (the lattice analogue of Graph Isomorphism), which simply asks whether the minimal distortion is one. As our first contribution, we show that the distortion betwe...
متن کاملA Lattice-based Graph Index for Subgraph Search
Given a query graph q, a “subgraph-search” algorithm retrieves from a graph database D all graphs that have q as a subgraph, D(q). Subgraph search is costly because of its involvement of a subgraph-isomorphism test, which is a NPcomplete problem. Graph indexes are used to improve the algorithm efficiency by first filtering out a set of false answers and then verifying each graph that has passed...
متن کاملSimple axiomatization of reticulations on residuated lattices
We give a simple and independent axiomatization of reticulations on residuated lattices, which were axiomatized by five conditions in [C. Mureşan, The reticulation of a residuated lattice, Bull. Math. Soc. Sci. Math. Roumanie 51 (2008), no. 1, 47--65]. Moreover, we show that reticulations can be considered as lattice homomorphisms between residuated lattices and b...
متن کاملZero-Knowledge Interactive Proof Systems for New Lattice Problems
In this work we introduce a new hard problem in lattices called Isometric Lattice Problem (ILP) and reduce Linear Code Equivalence over prime fields and Graph Isomorphism to this problem. We also show that this problem has an (efficient prover) perfect zero-knowledge interactive proof; this is the only hard problem in lattices that is known to have this property (with respect to malicious verif...
متن کاملA note on soft topological spaces
This paper demonstrates the redundancies concerning the increasing popular ``soft set" approaches to general topologies. It is shown that there is a complement preserving isomorphism (preserving arbitrary $widetilde{bigcup}$ and arbitrary $widetilde{bigcap}$) between the lattice ($mathcal{ST}_E(X,E),widetilde{subset}$) of all soft sets on $X$ with the whole parameter set $E$ as domains and the ...
متن کامل